A deterministic version of Pollard’s $p-1$ algorithm
نویسندگان
چکیده
منابع مشابه
A deterministic version of Pollard's p-1 algorithm
In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard’s p−1 algorithm, which finds in random polynomial time the prime divisors p of an integer n such that p− 1 is smooth. We show that these prime factors can be recovered in deterministic polynomial time. We further generalize this re...
متن کاملOn Sequential and 1-Deterministic P Systems
The original definition of P-systems calls for rules to be applied in a maximally parallel fashion. However, in some cases a sequential model may be a more reasonable assumption. Here we study the computational power of different variants of sequential P-systems. Initially we look at cooperative systems operating on symbol objects and without prioritized rules, but which allow membrane dissolut...
متن کاملList version of ($p$,1)-total labellings
The (p,1)-total number λp (G) of a graph G is the width of the smallest range of integers that suffices to label the vertices and the edges of G such that no two adjacent vertices have the same label, no two incident edges have the same label and the difference between the labels of a vertex and its incident edges is at least p. In this paper we consider the list version. Let L(x) be a list of ...
متن کاملReliability and Validity of Bedside Version of Persian WAB (P-WAB-1)
Introduction: In this study, we reported the reliability and validity of Bedside version of Persian WAB (P-WAB-1) adapted from Western Aphasia Battery (WAB-R)1,2. P-WAB-1 is a clinical linguistic measuring tool to determine severity and type of aphasia in brain damaged patients based on Aphasia Quotient (AQ) as a functional measure. For the purposes of a quick clinical screening of aphasia in...
متن کاملA deterministic rescaled perceptron algorithm
The perceptron algorithm is a simple iterative procedure for finding a point in a convex cone F . At each iteration, the algorithm only involves a query to a separation oracle for F and a simple update on a trial solution. The perceptron algorithm is guaranteed to find a point in F after O(1/τ F ) iterations, where τF is the width of the cone F . We propose a version of the perceptron algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2010
ISSN: 0025-5718,1088-6842
DOI: 10.1090/s0025-5718-09-02262-5